PIECEWISE LINEAR DYNAMIC PROGRAMS WITH APPLICATIONS
نویسندگان
چکیده
منابع مشابه
Piecewise Linear Dynamic Programs with Applications
PIECEWISE LINEAR DYNAMIC PROGRAMS WITH APPLICATIONS Katsushige Sawaki Nanzan University (Received May 22, 1978; Revised May 11, 1979) This paper considers a special class of dynamic programs which satisfies the monotone and contraction assumptions. This class of dynamic programs is charaC1:erized by the piecewise linearity that the cost function is piecewise linear whenever the terminal cost fu...
متن کاملPiecewise Linear Solution Paths for Parametric Piecewise Quadratic Programs
Recently, pathfollowing algorithms for parametric optimization problems with piecewise linear solution paths have been developed within the field of regularized regression. This paper presents a generalization of these algorithms to a wider class of problems, namely a class of parametric piecewise quadratic programs and related problems. By using pathfollowing algorithms that exploit the piecew...
متن کاملLocal Smooth Representations of Parametric Semiclosed Polyhedra with Applications to Sensitivity in Piecewise Linear Programs
In this paper, we establish the equivalence between the half-space representation and the vertex representation of a smooth parametric semiclosed polyhedron. By virtue of the smooth representation result, we prove that the solution set of a smooth parametric piecewise linear program can be locally represented as a finite union of parametric semiclosed polyhedra generated by finite smooth functi...
متن کاملConditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal solution of such a problem we associate a condition number which characterizes well or ill conditioning of the problem. Using theory of Large Deviations we show that the sample size needed to calculate the optimal solu...
متن کاملSolving Piecewise-Linear Programs: Experiments with a Simplex Approach
We report tests of CPLP, a piecewise-linear simplex implementation based on the XMP subroutine library. Using test problems of various shapes and origins, we judge CPLP against a comparable linear bounded-variable simplex code that is applied to equivalent linear programs. Our evidence indicates that CPLP is typically 2 to 3 times faster in solving the test problems that are most signiicantly p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1980
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.23.91